Automatic Generation of Symmetry-Breaking Constraints

نویسنده

  • Leo Liberti
چکیده

Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of solution symmetries, and two different types of symmetry-breaking constraints to eliminate these symmetries at the modelling level. We discuss some preliminary computational results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the generation of symmetry breaking constraints for mathematical programs

Mathematical programs whose formulation is symmetric often take a long time to solve using Branch-and-Bound type algorithms, because of the several symmetric optima. One of the techniques used to decrease the adverse effects of symmetry is adjoining symmetry breaking constraints to the formulation before solving the problem. These constraints aim to make some of the symmetric optima infeasible ...

متن کامل

Restrictions on B - L Symmetry Breaking Implied by a Fourth Generation Neutrino †

We point out that if the fourth generation neutrino is a Majorana fermion, then the astrophysical constraints coupled with the precision measurements of the Z-width at LEP require that the corresponding B-L symmetry is unlikely to be a spontaneously broken global symmetry. If B-L is chosen to be a local symmetry, its breaking scale should be less than a few TeV.

متن کامل

Isospin Breaking and the Top-quark Mass in Models of Dynamical Electroweak Symmetry Breaking∗

In this talk we review the physics of top-quark mass generation in models of dynamical electroweak symmetry breaking and the constraints on this physics arising from limits on the deviation of the weak interaction ρ-parameter from one. We then discuss top-color assisted technicolor in this context. 1. mt in Models of Dynamical Electroweak Symmetry Breaking In technicolor models, the masses of t...

متن کامل

Dynamic Symmetry Breaking Constraints

We present a general method for dynamically posting symmetry breaking constraints during search. The basic idea is very simple. Given any set of symmetry breaking constraints, if during search a symmetry of one of these constraints is entailed and this is consistent with previously posted symmetry breaking constraints, then we post this constraint. We illustrate the method with two examples whe...

متن کامل

Symmetry Breaking Constraints: Recent Results

Symmetry is an important problem in many combinatorial problems. One way of dealing with symmetry is to add constraints that eliminate symmetric solutions. We survey recent results in this area, focusing especially on two common and useful cases: symmetry breaking constraints for row and column symmetry, and symmetry breaking constraints for eliminating value symmetry.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008